Visible Decomposition: Real-Time Path Planning in Large Planar Environments
نویسنده
چکیده
We describe a method called Visible Decomposition for computing collision-free paths in real time through a planar environment with a large number of obstacles. This method divides space into local visibility graphs, ensuring that all operations are local. The search time is kept low since the number of regions is proved to be small. We analyze the computational demands of the algorithm and the quality of the paths it produces. In addition, we show test results on a large simulation testbed.
منابع مشابه
The Explicit Corridor Map: Using the Medial Axis for Real-Time Path Planning and Crowd Simulation
We describe and demonstrate the Explicit Corridor Map (ECM), a navigation mesh for path planning and crowd simulation in virtual environments. For a bounded 2D environment with polygonal obstacles, the ECM is the medial axis of the free space annotated with nearest-obstacle information. It can be used to compute short and smooth paths for disk-shaped characters of any radius. It is also well-de...
متن کاملReal-time path planning using harmonic potentials in dynamic environments
Motivated by fluid analogies, artificial harmonic potentials can eliminate local m in ima problems in robot path planning. I n this paper, simple analytical solut ions t o planar harmonic potentials are derived using tools f r o m fluid mechanics, and are applied t o two-dimensional planning among multiple moving obstacles. These closed-form solutions enable real-time computation to be readily ...
متن کاملMap Learning and Coverage Planning for Robots in Large Unknown Environments
The robotics field has seen indoor robots that are increasingly capable of accurately navigating in buildings and performing service tasks, such as cleaning and transporting items. Given the advances in accurate navigation and robust motion planning, large scale industrial applications become feasible tasks. Two common tasks are the mapping of large unknown structured spaces and using learned m...
متن کاملPath Planning for Mobile Robots Operating in Outdoor Environments Using Map Overlay and Triangular Decomposition
This paper addresses the mobile robot motion planning problem in outdoor environments, which are large, sparsely occupied workspaces with uneven terrains. We present results in path planning using an efficient discretization method based on Constrained Delaunay Triangulation (CDT) and classical graph searching algorithms. CDT has been proven to be a good method for representing complex shaped o...
متن کامل